Restoration of Matrix Fields by SOCP
نویسنده
چکیده
Wherever anisotropic behaviour in physical measurements or models is encountered matrices provide adequate means to describe this anisotropy. Prominent examples are the di usion tensor magnetic resonance imaging in medical imaging or the stress tensor in civil engineering. As most measured data these matrix-valued data are also polluted by noise and require restoration. The restoration of scalar images corrupted by noise via minimization of an energy functional is a well-established technique that o ers many advantages. A convenient way to achieve this minimization is second order cone programming (SOCP). The goal of this article is to transfer this method to the matrix-valued setting. It is shown how SOCP can be extended to minimize energy functionals de ned for matrix elds. Furthermore, new functionals for the regularization of matrix data are proposed and the corresponding Euler-Lagrange equations derived by means of matrix di erential calculus. Numerous experiments substantiate the usefulness of the proposed methods for the restoration of matrix elds.
منابع مشابه
Sparse Second Order Cone Programming Formulations for Convex Optimization Problems
Second order cone program (SOCP) formulations of convex optimization problems are studied. We show that various SOCP formulations can be obtained depending on how auxiliary variables are introduced. An efficient SOCP formulation that increases the computational efficiency is presented by investigating the relationship between the sparsity of an SOCP formulation and the sparsity of the Schur com...
متن کاملSecond order cone programming relaxation of a positive semidefinite constraint
The positive semideenite constraint for the variable matrix in semideenite programming (SDP) relaxation is further relaxed by a nite number of second order cone constraints in second order cone programming (SOCP) relaxations. A few types of SOCP relaxations are obtained from diierent ways of expressing the positive semideenite constraint of the SDP relaxation. We present how such SOCP relaxatio...
متن کاملEstimating the Fundamental Matrix Using Second-Order Cone Programming
Computing the fundamental matrix is the first step of many computer vision applications including camera calibration, image rectification and structure from motion. A new method for the estimation of the fundamental matrix from point correspondences is presented. The minimization of the geometric error is performed based Linfinity norm minimization framework. A single global minimum exists and ...
متن کاملSecond-order cone programming
Second-order cone programming (SOCP) problems are convex optimization problems in which a linear function is minimized over the intersection of an affine linear manifold with the Cartesian product of second-order (Lorentz) cones. Linear programs, convex quadratic programs and quadratically constrained convex quadratic programs can all be formulated as SOCP problems, as can many other problems t...
متن کاملSOCP Radiotherapy Benchmark Test Case in CBLIB
This document briefly describes how a couple of radiotherapy secondorder cone program (SOCP) benchmark test cases were generated. The seven-beam and thirty-beam cases are now part of the conic benchmark library CBLIB, http://cblib.zib.de/. The basic radiotherapy optimization problem is optimize the beam intensities delivered from various angles around the patient so as to minimize dose to healt...
متن کامل